Revista CD Expert 41

home *** CD-ROM | disk | FTP | other *** search

/ Revista CD Expert 41 / CD Expert nº 41.iso / Hellboy / data1.cab / Game_Data / data / ai / old_quadrangle_e3.map < prev next >

Wrap

Text File | 2000-08-18 | 14.8 KB | 506 lines

// DH INTERACTIVE LLC, COPYRIGHT (C) 1999 // 57 // file_type 100 // file_version 12 // map node array size // path node array for node 0 node_0 // node name -450 40 -450 // node location 12 // path array size 1 // number of possible start node indexes 0 // to get to node 0 1 // number of possible start node indexes 2 // to get to node 1 1 // number of possible start node indexes 2 // to get to node 2 1 // number of possible start node indexes 2 // to get to node 3 1 // number of possible start node indexes 2 // to get to node 4 1 // number of possible start node indexes 2 // to get to node 5 1 // number of possible start node indexes 10 // to get to node 6 1 // number of possible start node indexes 10 // to get to node 7 1 // number of possible start node indexes 10 // to get to node 8 1 // number of possible start node indexes 10 // to get to node 9 1 // number of possible start node indexes 10 // to get to node 10 1 // number of possible start node indexes 10 // to get to node 11 // path node array for node 1 node_1 // node name -475 40 0 // node location 12 // path array size 1 // number of possible start node indexes 0 // to get to node 0 1 // number of possible start node indexes 1 // to get to node 1 1 // number of possible start node indexes 0 // to get to node 2 1 // number of possible start node indexes 0 // to get to node 3 1 // number of possible start node indexes 3 // to get to node 4 1 // number of possible start node indexes 3 // to get to node 5 1 // number of possible start node indexes 3 // to get to node 6 1 // number of possible start node indexes 3 // to get to node 7 1 // number of possible start node indexes 0 // to get to node 8 1 // number of possible start node indexes 0 // to get to node 9 1 // number of possible start node indexes 0 // to get to node 10 1 // number of possible start node indexes 0 // to get to node 11 // path node array for node 2 node_2 // node name -400 40 0 // node location 12 // path array size 1 // number of possible start node indexes 1 // to get to node 0 1 // number of possible start node indexes 1 // to get to node 1 1 // number of possible start node indexes 2 // to get to node 2 1 // number of possible start node indexes 3 // to get to node 3 1 // number of possible start node indexes 3 // to get to node 4 1 // number of possible start node indexes 3 // to get to node 5 1 // number of possible start node indexes 3 // to get to node 6 1 // number of possible start node indexes 3 // to get to node 7 1 // number of possible start node indexes 3 // to get to node 8 1 // number of possible start node indexes 3 // to get to node 9 1 // number of possible start node indexes 3 // to get to node 10 1 // number of possible start node indexes 3 // to get to node 11 // path node array for node 3 node_3 // node name -450 40 450 // node location 12 // path array size 1 // number of possible start node indexes 1 // to get to node 0 1 // number of possible start node indexes 1 // to get to node 1 1 // number of possible start node indexes 1 // to get to node 2 1 // number of possible start node indexes 3 // to get to node 3 1 // number of possible start node indexes 4 // to get to node 4 1 // number of possible start node indexes 4 // to get to node 5 1 // number of possible start node indexes 4 // to get to node 6 1 // number of possible start node indexes 1 // to get to node 7 1 // number of possible start node indexes 4 // to get to node 8 1 // number of possible start node indexes 1 // to get to node 9 1 // number of possible start node indexes 1 // to get to node 10 1 // number of possible start node indexes 1 // to get to node 11 // path node array for node 4 node_4 // node name 0 40 475 // node location 12 // path array size 1 // number of possible start node indexes 6 // to get to node 0 1 // number of possible start node indexes 6 // to get to node 1 1 // number of possible start node indexes 6 // to get to node 2 1 // number of possible start node indexes 6 // to get to node 3 1 // number of possible start node indexes 6 // to get to node 4 1 // number of possible start node indexes 6 // to get to node 5 1 // number of possible start node indexes 6 // to get to node 6 1 // number of possible start node indexes 6 // to get to node 7 1 // number of possible start node indexes 6 // to get to node 8 1 // number of possible start node indexes 6 // to get to node 9 1 // number of possible start node indexes 6 // to get to node 10 1 // number of possible start node indexes 6 // to get to node 11 // path node array for node 5 node_5 // node name 0 40 400 // node location 12 // path array size 1 // number of possible start node indexes 3 // to get to node 0 1 // number of possible start node indexes 3 // to get to node 1 1 // number of possible start node indexes 3 // to get to node 2 1 // number of possible start node indexes 3 // to get to node 3 1 // number of possible start node indexes 3 // to get to node 4 1 // number of possible start node indexes 5 // to get to node 5 1 // number of possible start node indexes 3 // to get to node 6 1 // number of possible start node indexes 3 // to get to node 7 1 // number of possible start node indexes 3 // to get to node 8 1 // number of possible start node indexes 3 // to get to node 9 1 // number of possible start node indexes 3 // to get to node 10 1 // number of possible start node indexes 3 // to get to node 11 // path node array for node 6 node_6 // node name 450 40 450 // node location 12 // path array size 1 // number of possible start node indexes 5 // to get to node 0 1 // number of possible start node indexes 5 // to get to node 1 1 // number of possible start node indexes 5 // to get to node 2 1 // number of possible start node indexes 5 // to get to node 3 1 // number of possible start node indexes 5 // to get to node 4 1 // number of possible start node indexes 5 // to get to node 5 1 // number of possible start node indexes 6 // to get to node 6 1 // number of possible start node indexes 5 // to get to node 7 1 // number of possible start node indexes 8 // to get to node 8 1 // number of possible start node indexes 8 // to get to node 9 1 // number of possible start node indexes 8 // to get to node 10 1 // number of possible start node indexes 8 // to get to node 11 // path node array for node 7 node_7 // node name 400 40 0 // node location 12 // path array size 1 // number of possible start node indexes 8 // to get to node 0 1 // number of possible start node indexes 6 // to get to node 1 1 // number of possible start node indexes 6 // to get to node 2 1 // number of possible start node indexes 8 // to get to node 3 1 // number of possible start node indexes 6 // to get to node 4 1 // number of possible start node indexes 6 // to get to node 5 1 // number of possible start node indexes 6 // to get to node 6 1 // number of possible start node indexes 6 // to get to node 7 1 // number of possible start node indexes 6 // to get to node 8 1 // number of possible start node indexes 8 // to get to node 9 1 // number of possible start node indexes 8 // to get to node 10 1 // number of possible start node indexes 8 // to get to node 11 // path node array for node 8 node_8 // node name 475 40 0 // node location 12 // path array size 1 // number of possible start node indexes 9 // to get to node 0 1 // number of possible start node indexes 9 // to get to node 1 1 // number of possible start node indexes 9 // to get to node 2 1 // number of possible start node indexes 9 // to get to node 3 1 // number of possible start node indexes 9 // to get to node 4 1 // number of possible start node indexes 9 // to get to node 5 1 // number of possible start node indexes 9 // to get to node 6 1 // number of possible start node indexes 9 // to get to node 7 1 // number of possible start node indexes 8 // to get to node 8 1 // number of possible start node indexes 9 // to get to node 9 1 // number of possible start node indexes 9 // to get to node 10 1 // number of possible start node indexes 9 // to get to node 11 // path node array for node 9 node_9 // node name 450 40 -450 // node location 12 // path array size 1 // number of possible start node indexes 11 // to get to node 0 1 // number of possible start node indexes 11 // to get to node 1 1 // number of possible start node indexes 7 // to get to node 2 1 // number of possible start node indexes 11 // to get to node 3 1 // number of possible start node indexes 11 // to get to node 4 1 // number of possible start node indexes 7 // to get to node 5 1 // number of possible start node indexes 7 // to get to node 6 1 // number of possible start node indexes 7 // to get to node 7 1 // number of possible start node indexes 7 // to get to node 8 1 // number of possible start node indexes 9 // to get to node 9 1 // number of possible start node indexes 11 // to get to node 10 1 // number of possible start node indexes 11 // to get to node 11 // path node array for node 10 node_10 // node name 0 40 -400 // node location 12 // path array size 1 // number of possible start node indexes 9 // to get to node 0 1 // number of possible start node indexes 9 // to get to node 1 1 // number of possible start node indexes 9 // to get to node 2 1 // number of possible start node indexes 9 // to get to node 3 1 // number of possible start node indexes 9 // to get to node 4 1 // number of possible start node indexes 9 // to get to node 5 1 // number of possible start node indexes 9 // to get to node 6 1 // number of possible start node indexes 9 // to get to node 7 1 // number of possible start node indexes 9 // to get to node 8 1 // number of possible start node indexes 9 // to get to node 9 1 // number of possible start node indexes 9 // to get to node 10 1 // number of possible start node indexes 9 // to get to node 11 // path node array for node 11 node_11 // node name 0 40 475 // node location 12 // path array size 1 // number of possible start node indexes 0 // to get to node 0 1 // number of possible start node indexes 0 // to get to node 1 1 // number of possible start node indexes 10 // to get to node 2 1 // number of possible start node indexes 0 // to get to node 3 1 // number of possible start node indexes 0 // to get to node 4 1 // number of possible start node indexes 10 // to get to node 5 1 // number of possible start node indexes 10 // to get to node 6 1 // number of possible start node indexes 0 // to get to node 7 1 // number of possible start node indexes 10 // to get to node 8 1 // number of possible start node indexes 10 // to get to node 9 1 // number of possible start node indexes 10 // to get to node 10 1 // number of possible start node indexes 11 // to get to node 11